Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart
نویسندگان
چکیده
منابع مشابه
Ununfoldable polyhedra with convex faces
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further ...
متن کاملColoring planar graphs with triangles far apart
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable.
متن کاملConvex Polyhedra with Triangular Faces and Cone Triangulation
Considering the problem of the minimal triangulation for a given polyhedra (dividing polyhedra into tetrahedra) it is known that the cone triangulation provides the number of tetrahedra which is the smallest, or the closest to it. It is also shown that when we want to know whether the cone triangulation is the minimal one, it is necessary to find the order of all vertices, as well as the order ...
متن کاملHow far apart are classical and quantum systems ? ∗
As is well known, classical systems approximate quantum ones – but how well? We introduce a definition of a “distance” on classical and quantum phase spaces that offers a measure of their separation. Such a distance scale provides a means to measure the quality of approximate solutions to various problems. A few simple applications are discussed. Introduction The purpose of this paper is to int...
متن کاملThe journey so far
As part of our efforts in establishing biij as one of the important open-access journals dealing with topics relating to radiology, biomedical imaging and biomedical intervention, we have tirelessly pursued the indexing of biij in various relevant scientific indices and databases. For this reason, biij has been a member of CrossRef and has been made searchable by the Google Scholar search engin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2002
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2109